Two Bit Quantum Protocol for a Three Party Modular Function
نویسندگان
چکیده
Communicational complexity problem among three parties for the calculation of a three party inner product modular function is discussed, where each party possess some of the function’s input. Classical communicational complexity of this function can be evaluated by three classical bits. In classical theory, the three party modular function can’t be evaluated by two classical bits, but using quantum entanglement in quantum theory two classical bits are sufficient to calculate the three party problem.
منابع مشابه
Quantum Byzantine Agreement via Hardy correlations and entanglement swapping
We present a device-independent quantum scheme for the Byzantine Generals problem. The protocol is for three parties. Party C is to send two identical one bit messages to parties A and B. The receivers A and B may exchange two one bit messages informing the other party on the message received from C. A bit flipping error in one of the transmissions, does not allow the receiving parties to estab...
متن کاملMulti-Party Quantum Dialogue with the Capability to Expand the Number of Users at Runtime
Quantum dialogue is a type of quantum communication in which users can simultaneously send messages to each other. The earliest instances of quantum dialogue protocols faced security problems such as information leakage and were vulnerable to intercept and resend attacks. Therefore, several protocols have been presented that try to solve these defects. Despite these improvements, the quantum di...
متن کاملQuantum Bit Commitment
This paper is reversing the current belief on Quantum Bit Commitment. Several papers have claimed and given a formal proof that quantum bit commitment is impossible. Nevertheless, the hypotheses of the formal mathematical model are too restrictive and do not exhaustively reflect the original definition of the problem. They share the same unnecessary restriction that the responsibility of hiding...
متن کاملThe Search for the Holy Grail in Quantum Cryptography
In 1982, Bennett and Brassard suggested a new way to provide privacy in long distance communications with security based on the correctness of the basic principles of quantum mechanics. The scheme allows two parties, Alice and Bob, sharing no secret information in the first place, to exchange messages that nobody else can figure out. The only requirement is a quantum channel and a normal phone ...
متن کاملQuantum Gambling
Quantum cryptography is a field which combines quantum theory with information theory. The goal of this field is to use the laws of physics to provide secure information exchange, in contrast to classical methods based on (unproven) complexity assumptions. In particular, quantum key distribution protocols [1] became especially important due to technological advances which allow their implementa...
متن کامل